Tree-search algorithms for quadratic assignment problems
نویسندگان
چکیده
منابع مشابه
Tabu Search and Hybrid Genetic Algorithms for Quadratic Assignment Problems
In this chapter experience with solving quadratic assignment problems is reported. The results reported in this chapter are the best results for heuristic solutions of the quadratic assignment problem available to date and can serve as bench mark results for future researchers who propose new approaches for solving quadratic assignment problems. The most effective method to date for solving qua...
متن کاملAlfred P . Sloan School of Management Tree - Search Algorithms for Quadratic Assignment Problems
Problems having the mathematical structure of a quadratic assignment problem are found in a diversity of contexts: by the economist in assigning a number of plants or Indivisible operations to a number of different geographical locations; by the architect or industrial engineer in laying out activities, offices or departments in a building; by the human engineer in arranging the indicators and ...
متن کاملParallel Algorithms for Chaotic Exponential Tabu Search Hardware for Quadratic Assignment Problems
The quadratic assignment problem (QAP) is one of the nondeterministic polynomial (NP)-hard combinatorial optimization problems. One of the heuristic algorithms for the QAP is tabu-search. Exponential tabusearch, which is one of improved versions of the tabu search, was proposed using a neural network, and it was further extended to chaotic tabu search with a chaotic neural network. Chaotic dyna...
متن کاملTesting of Hybrid Genetic Algorithms for Structured Quadratic Assignment Problems
In this paper, an efficient hybrid genetic algorithm (HGA) and its variants for the wellknown combinatorial optimization problem, the quadratic assignment problem (QAP) are discussed. In particular, we tested our algorithms on a special type of QAPs, the structured quadratic assignment problems. The results from the computational experiments on this class of problems demonstrate that HGAs allow...
متن کاملSolving Quadratic Assignment Problems
We describe a branch-and-bound algorithm for the quadratic assignment problem (QAP) that uses a convex quadratic programming (QP) relaxation to obtain a bound at each node. The QP subproblems are approximately solved using the Frank-Wolfe algorithm, which in this case requires the solution of a linear assignment problem on each iteration. Our branching strategy makes extensive use of dual infor...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Naval Research Logistics Quarterly
سال: 1971
ISSN: 0028-1441,1931-9193
DOI: 10.1002/nav.3800180102